Interpolating sparse scattered data using flow information

نویسندگان

  • Gregory J. Streletz
  • Geoffrey Gebbie
  • Oliver Kreylos
  • Bernd Hamann
  • Louise H. Kellogg
  • Howard J. Spero
چکیده

Scattered data interpolation and approximation techniques allow for the reconstruction of a scalar field based upon a finite number of scattered samples of the field. In general, the fidelity of the reconstruction with respect to the original scalar field tends to deteriorate as the number of samples decreases. For the situation of very sparse sampling, the results may not be acceptable at all. However, if it is known that the scalar field of interest is correlated with a known flow field – as is the case when the scalar field represents the value of an oceanographic tracer that propagates under the influence of the ocean’s flow – then this knowledge can be exploited to enhance the scattered data reconstruction method. One way to exploit flow field information is to use it to construct a modified notion of distance between points. Replacing the standard Euclidean distance metric with a flow-field-aware notion of distance provides a method for extending standard scattered data interpolation methods into flow-based methods that produce superior results for very sparse data. The resulting reconstructions typically have lower root-mean-square errors than reconstructions that do not use the flow information, and qualitatively they often appear physically

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust FEM-based extraction of finite-time coherent sets using scattered, sparse, and incomplete trajectories

Transport and mixing properties of aperiodic flows are crucial to a dynamical analysis of the flow, and often have to be carried out with limited information. Finite-time coherent sets are regions of the flow that minimally mix with the remainder of the flow domain over the finite period of time considered. In the purely advective setting this is equivalent to identifying sets whose boundary in...

متن کامل

Fast Interpolation and Approximation of Scattered Multidimensional and Dynamic Data Using Radial Basis Functions

Interpolation or approximation of scattered data is very often task in engineering problems. The Radial Basis Functions (RBF) interpolation is convenient for scattered (un-ordered) data sets in k-dimensional space, in general. This approach is convenient especially for a higher dimension k > 2 as the conversion to an ordered data set, e.g. using tessellation, is computationally very expensive. ...

متن کامل

Multistep Scattered Data Interpolation using Compactly Supported Radial Basis Functions

A hierarchical scheme is presented for smoothly interpolating scattered data with radial basis functions of compact support. A nested sequence of subsets of the data is computed efficiently using successive Delaunay triangulations. The scale of the basis function at each level is determined from the current density of the points using information from the triangulation. The method is rotational...

متن کامل

An Improved Method for Analyzing Sparse and Irregularly Distributed SST Data on a Regular Grid: The Tropical Pacific Ocean

An improved method for interpolating sparsely sampled climatological data onto a regular grid is shown. The method uses the spatial and temporal covariance of the field, along with the sparse data, to fill the full grid. This improves on similar methods that have recently been developed by eliminating the development of features that are not sufficiently supported by the data (i.e., overfitting...

متن کامل

Scattered Data Interpolation in N-Dimensional Space

Radial Basis Functions (RBF) interpolation theory is briefly introduced at the “application level” including some basic principles and computational issues. The RBF interpolation is convenient for un-ordered data sets in n-dimensional space, in general. This approach is convenient especially for a higher dimension N 2 conversion to ordered data set, e.g. using tessellation, is computationally v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comput. Science

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2016